package com.atguigu.array_a;
//数组算法之数组翻转
public class ArrayDemo1 {

    public static void main(String[] args){

        int[] arr = {11,22,33,44,55,66,77,88,99};

        for (int min = 0,max = arr.length - 1; min < max ; min++,max--) {

            int temp = arr[min];
            arr[min] = arr[max];
            arr[max] = temp;
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
    }
}
